Modeling and Realization of the Floating Point Inverse Square Root, Square Root, and Division unit (fP ISD) Using VHDL and FPGAs

نویسنده

  • Jaafar Alghazo
چکیده

In this paper, we model and synthesis a high speed Arithmetic inverse square root, square root, and division (ISD) unit based on existing algorithms similar to the unit in [3]. With area/speed tradeoff limitation, our concentration was on designing high speed Arithmetic units with moderate area increase. Our concentration on the (ISD) unit using digit recurrence algorithms led to the modeling of a robust unit, sharing the same recurrence and same hardware to perform all three operations. Minor differences occur in the initialization stage and number of iterations and final rounding. Synthesis tools were used to evaluate our model and reports showed that our ISD unit has a minimum path delay of 12.443ns. Area was moderate and within range when theoretically comparing three separate units to complete the three operations. We further decrease the latency of the ISD unit by modeling short fast adder in the critical path.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Variable Precision Floating-Point Divide and Square Root for Efficient FPGA Implementation of Image and Signal Processing Algorithms

Field Programmable Gate Arrays (FPGAs) are frequently used to accelerate signal and image processing algorithms due to their flexibility, relatively low cost, high performance and fast time to market. For those applications where the data has large dynamic range, floating-point arithmetic is desirable due to the inherent limitations of fixed-point arithmetic. Moreover, optimal reconfigurable ha...

متن کامل

On portable macrocell FPU generators for division and square root operators complying to the full IEEE-754 standard

In this paper we investigate the design of macro-cell generators of division and square root floating-point operators. The number representation used in our operators is the IEEE-754-1985 standard for binary floating-point numbers. The design and implementation of the generators rely on a powerful multiview layout synthesis tool called GenOptim. This CAD tool is able to output a set of differen...

متن کامل

High-Speed Double-Precision Computation of Reciprocal, Division, Square Root and Inverse Square Root

A new method for the high-speed computation of double-precision floating-point reciprocal, division, square root, and inverse square root operations is presented in this paper. This method employs a second-degree minimax polynomial approximation to obtain an accurate initial estimate of the reciprocal and the inverse square root values, and then performs a modified Goldschmidt iteration. The hi...

متن کامل

Low-Power Radix-4 Combined Division and Square Root

Because of the similarities in the algorithm it is quite common to implement division and square root in the same unit. The purpose of this work is to implement a low-power combined radix-4 division and square root floating-point double precision unit and to compare its performance and energy consumption with a radix-4 division only unit. Previous work has been done on reducing the energy dissi...

متن کامل

Implementation of single precision floating point square root on FPGAs

Square root operation is hard to implement on FPGAs because of the complexity of the algorithms. In this paper, we present a non-restoring square root algorithm and two very simple single precision floating point square root implementations based on the algorithm on FPGAs. One is low-cost iterative implementation that uses a traditional adder/subtractor. The operation latency is 25 clock cycles...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006